Tabu search algorithm for RP selection in PIM-SM multicast routing
نویسندگان
چکیده
منابع مشابه
Tabu search algorithm for RP selection in PIM-SM multicast routing
To construct a multicast tree is the basis of multicast data transmission. The prime problem concerning the construction of a shared multicast tree is to determine the position of the root of the shared tree, which is the center selection problem. The selection of the center directly affects the structure of the tree, and affects the performance of multicast accordingly. The center selection pr...
متن کاملExtension of RP relocation to PIM-SM multicast routing
| The Protocol Independent Multicast-Sparse Mode (PIM-SM) protocol establishes core-base tree to forward multicast datagrams in a network. In PIM-SM, the core or Rendezvous Point (RP) of a group is determined at each multicast router by hashing a group address, i.e., a class-D IP address, to one of the candidate RPs. The hash function is characterized by its ability to evenly and uniquely choos...
متن کاملHierarchical PIM-SM Architecture for Inter-Domain Multicast Routing
Force (IETF), its Areas, and its Working Groups. (Note that other groups may also distribute working documents as Internet Drafts). Internet Drafts are draft documents valid for a maximum of six months. Internet Drafts may be updated, replaced, or obsoleted by other documents at any time. It is not appropriate to use Internet Drafts as reference material or to cite them other than as a \working...
متن کاملRPIM-SM: extending PIM-SM for RP relocation
The protocol independent multicast-sparse mode (PIM-SM) protocol establishes core-base tree to forward multicast datagrams in a network. In PIM-SM, the core or rendezvous point (RP) of a group is determined at each multicast router by hashing a group address, i.e. a class-D IP address, to one of the candidate RPs. The hash function is characterized by its ability to evenly and uniquely choose t...
متن کاملTSDLMRA: an efficient multicast routing algorithm based on Tabu search
As a NP-Complete problem, multicast routing with delay constraint is a research difficulty in routing problem. Tabu Search is artificial intelligence algorithm, which is an extension of local search algorithm and has simple realization and well properties. In this paper, an efficient algorithm based on Tabu Search for Delay-Constrained Low-Cost Multicast Routing is proposed to solve delay-const...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Communications
سال: 2010
ISSN: 0140-3664
DOI: 10.1016/j.comcom.2009.07.015